Finding Loop Invariants Based on Wu's Characteristic Set Method
نویسندگان
چکیده
منابع مشابه
Finding Polynomial Loop Invariants for Probabilistic Programs
Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing polynomial invariants. In this paper, we propose an alternative approach. First, we fix a polynomial template as a candidate of a loop invariant. Using Stengle’s Positivstellensatz and a transformation to a sum-of-squ...
متن کاملLoop Invariants on Demand
This paper describes a sound technique that combines the precision of theorem proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invoked on demand when the need for a stronger loop invariant arises, which allows a gradual increase in the level of precision used by the abstract interpreter. The technique generates loop invariants that are sp...
متن کاملOn orthogonal invariants in characteristic 2
Working over an algebraically closed base field k of characteristic 2, the ring of invariants R is studied, where G is the orthogonal group O(n) or the special orthogonal group SO(n), acting naturally on the coordinate ring R of the m-fold direct sum k⊕ · · · ⊕ k of the standard vector representation. It is proved for O(2), O(3) = SO(3), SO(4), and O(4), that there exists an m-linear invariant ...
متن کاملMaximal and Compositional Pattern-Based Loop Invariants
We present a novel approach for the automatic generation of inductive loop invariants over loops manipulating arrays. Unlike most existing approaches, it generates invariants containing disjunctions and quantifiers, which are rich enough for proving functional properties over programs which manipulate arrays. Our approach does not require the user to provide initial assertions or postconditions...
متن کاملTalk on “ Loop Invariants on Demand ”
interpretation is a good method for deriving loop invariants, but, unfortunately, it does not work well with disjunctions. This is where the technique of the paper is supposed to help. The idea is to use a theorem prover to show that the assertion never fails for the set of traces corresponding to the second disjunct (N mod 2 6= 0). Thus the abstract interpreter can be run on the abstract state...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2010
ISSN: 1812-5638
DOI: 10.3923/itj.2010.349.353